Colored Invariants in Predicate/transition Nets
نویسندگان
چکیده
The duality properties of Peti Nets (PN) are exploiled in order to apply an algorithmfor the calculation of colored S-invaiants of Predicate Transition nets (Pr/T nets) to the calculation of the colored T-invariants.
منابع مشابه
On Petri Nets and Predicate-Transition Nets
Petri nets are used to study many types of networked systems. [1] have designed a software tool for analysis and simulation of Petri nets. We extend this tool to handle a form of Petri net known as Predicate Transition (PrT) nets. We implement mechanisms that automate the process of folding a Petri net to a PrT net and finding invariants. We can compute invariants for systems that use either Pe...
متن کاملA Formal Petri Net Based Model for Antivirus Update Agent System
In this paper, a formal model for antivirus update agent system is presented based on mobile agent technology and predicate/transition Petri nets. The mobile agent system contains two mobile agents called DCA and UNA. It sends out agents to update antivirus on client computers in a network. Each agent takes on a specified responsibility. First, DCA roams through the network and check the last d...
متن کاملA Formal Petri Net Based Model for Antivirus Update Agent System
In this paper, a formal model for antivirus update agent system is presented based on mobile agent technology and predicate/transition Petri nets. The mobile agent system contains two mobile agents called DCA and UNA. It sends out agents to update antivirus on client computers in a network. Each agent takes on a specified responsibility. First, DCA roams through the network and check the last d...
متن کاملA Formal Definition of Hierarchical Predicate Transition Nets
Hierarchical predicate transition nets have recently been introduced as a visual formalism for specifying complex reactive systems. They extend predicate transition nets with hierarchical structures so that large systems can be specified and understood stepwisely, and thus are more suitable for real-world applications. In this paper, we provide a formal syntax and an algebraic semantics for hie...
متن کاملSoftware Model Checking of Liveness Properties via Transition Invariants
Model checking is an automated method to prove safety and liveness properties for finite systems. Software model checking uses predicate abstraction to compute invariants and thus prove safety properties for infinite-state programs. We address the limitation of current software model checking methods to safety properties. Our results are a characterization of the validity of a liveness property...
متن کامل